Statistical QA - Classifier Vs. Re-Ranker: What's The Difference?
نویسندگان
چکیده
In this paper, we show that we can obtain a good baseline performance for Question Answering (QA) by using only 4 simple features. Using these features, we contrast two approaches used for a Maximum Entropy based QA system. We view the QA problem as a classification problem and as a reranking problem. Our results indicate that the QA system viewed as a reranker clearly outperforms the QA system used as a classifier. Both systems are trained using the same data.
منابع مشابه
R$^3$: Reinforced Reader-Ranker for Open-Domain Question Answering
In recent years researchers have achieved considerable success applying neural network methods to question answering (QA). These approaches have achieved state of the art results in simplified closed-domain settings such as the SQuAD (Rajpurkar et al. 2016) dataset, which provides a preselected passage, from which the answer to a given question may be extracted. More recently, researchers have ...
متن کاملR: Reinforced Ranker-Reader for Open-Domain Question Answering
In recent years researchers have achieved considerable success applying neural network methods to question answering (QA). These approaches have achieved state of the art results in simplified closed-domain settings such as the SQuAD (Rajpurkar et al. 2016) dataset, which provides a preselected passage, from which the answer to a given question may be extracted. More recently, researchers have ...
متن کاملOn classification, ranking, and probability estimation
Given a binary classification task, a ranker is an algorithm that can sort a set of instances from highest to lowest expectation that the instance is positive. In contrast to a classifier, a ranker does not output class predictions – although it can be turned into a classifier with help of an additional procedure to split the ranked list into two. A straightforward way to compute rankings is to...
متن کاملLinguistic kernels for answer re-ranking in question answering systems
Answer selection is the most complex phase of a Question Answering (QA) system. To solve this task, typical approaches use unsupervised methods such as computing the similarity between query and answer, optionally exploiting advanced syntactic, semantic or logic representations. In this paper, we study supervised discriminative models that learn to select (rank) answers using examples of questi...
متن کاملInformation vs. Robustness in Rank Aggregation: Models, Algorithms and a Statistical Framework for Evaluation
The rank aggregation problem has been studied extensively in recent years with a focus on how to combine several different rankers to obtain a consensus aggregate ranker. We study the rank aggregation problem from a different perspective: how the individual input rankers impact the performance of the aggregate ranker. We develop a general statistical framework based on a model of how the indivi...
متن کامل